Games of incomplete information: A framework based on belief functions

This paper proposes a model for incomplete-information games where the knowledge of players is represented by Dempster-Shafer belief function. Beyond an extension classical definitions, it shows such game can be transformed into equivalent hypergraphical complete-information (without uncertainty), thus generalizing Howson and Rosenthal's theorem to framework functions any number players. The complexity this transformation finally studied shown polynomial in degree k-additivity mass